ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM
نویسندگان
چکیده
This paper considers a bi-criteria planning problems on single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find Pareto set. We introduced strong relation between lower bound, upper bound number efficient solutions via theorem which shows also that is near optimal solution if small.
منابع مشابه
A single-machine bi-criterion scheduling problem with two agents
The multiple-agent scheduling problems have received increasing attention recently. However, most of the research focuses on studying the computational complexity of the intractable cases or examining problems with a single criterion. Often a decision maker has to decide the schedule based on multiple criteria. In this paper, we consider a single machine problem where the objective is to minimi...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملA polynomial algorithm for a bi-criteria cyclic scheduling problem
The minimization of the amount of initial tokens in a Weighted Timed Event Graph (in short WTEG) under throughput constraint is a crucial problem in industrial area such as the design of manufacturing systems or embedded systems. In this paper, an efficient polynomial algorithm is developed for the minimization of the overall places capacities with a maximum throughput. It is proved optimal for...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ma?alla? Tikr?t li-l-?ul?m al-?irfa?
سال: 2023
ISSN: ['2415-1726', '1813-1662']
DOI: https://doi.org/10.25130/tjps.v27i6.764